Multiple Pattern Matching Revisited

نویسندگان

  • Robert Susik
  • Szymon Grabowski
  • Kimmo Fredriksson
چکیده

We consider the classical exact multiple string matching problem. Our solution is based on q-grams combined with pattern superimposition, bit-parallelism and alphabet size reduction. We discuss the pros and cons of the various alternatives of how to achieve best combination. Our method is closely related to previous work by (Salmela et al., 2006). The experimental results show that our method performs well on different alphabet sizes and that they scale to large pattern sets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analytic Approach to Pattern Matching

7.0 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 327 7.1 Probabilistic models . . . . . . . . . . . . . . . . . . . . . . . . . 330 7.2 Exact string matching . . . . . . . . . . . . . . . . . . . . . . . . 333 7.2.1 Languages representations . . . . . . . . . . . . . . . . . 334 7.2.2 Generating functions . . . . . . . . . . . . . . . . . . . . 337 7.2.3 Moments and li...

متن کامل

The swap matching problem revisited

In this paper, we revisit the much studied problem of Pattern Matching with Swaps (Swap Matching problem, for short). We first present a graph-theoretic model, which opens a new and so far unexplored avenue to solve the problem. Then, using the model, we devise two efficient algorithms to solve the swap matching problem. The resulting algorithms are adaptations of the classic shift-and algorith...

متن کامل

Directional Pattern Matching for Character Recognition Revisited

Directional features have been successfully used for the recognition of both machine-printed and handwritten Kanji characters for the last decade. This paper attempts to explain why the directional features are effective. First, the advances of directional features and related methods are briefly reviewed. Then the properties that the similarity measure should hold are discussed and simulation ...

متن کامل

A Simpler Bit-parallel Algorithm for Swap Matching

The pattern matching problem with swaps is to find all occurrences of a pattern in a text while allowing the pattern to swap adjacent symbols. The goal is to design fast matching algorithm that takes advantage of the bit parallelism of bitwise machine instructions. We point out a fatal flaw in the algorithm proposed by Ahmed et al. [The swap matching problem revisited, Theor. Comp. Sci. 2014], ...

متن کامل

Induction of secondary axis in hydra revisited: New insights into pattern formation

In 1909, several years before the famous `Organizer’ experiments of Spemann and Mangold, Ethel Browne demonstrated induction of a secondary axis in hydra by grafting a hypostome. Based on this and subsequent work, in the late sixties, Lewis Wolpert proposed the theory of morphogen gradients and positional information. We have studied secondary axis induction by hypostome and foot tissue using t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014